Continuous Turing Machine: Real Function Computability and Iteration Issues
نویسندگان
چکیده
منابع مشابه
Continuous Turing Machine: Real Function Computability and Iteration Issues
Contemporary computer theory is governed by the discretization of continuous problems. Classical Turing machines (TMs) are originally built to solve computation and computability problems, which main feature is discreteness. However, even some simple numerical calculations problems, e.g., iterations in Rn, generate difficulties to be described or solved by constructing a TM. This paper explores...
متن کاملNon-Turing Computers and Non-Turing Computability*
Various examples of Malament-Hogarth (hereafter, M-H) spacetimes are given in Hogarth (1992), but the following artificial example from Earman and Norton (1993) is perhaps the simplest. Start with Minkowski spacetime (R4, η) and choose a scalar field Ω on M such that Ω=1 outside a compact set C⊂M and Ω tends rapidly to infinity as a point r∈C is approached. The spacetime (R4-r, Ω2η), depicted i...
متن کاملParallel Feedback Turing Computability
In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability. We investigate several different possible definitions of parallelism in this context, with an eye toward specifying what is so computable. For the determini...
متن کاملTuring and Post on Computability
[Turing then gives his formal definitions and in particular says that for a real number or function on the natural numbers to be computable it must be computable by amachine that gives an output for every input.] No attempt has yet been made to show that the "computable" numbers include all numbers which would naturally be regarded as computable. All arguments which can be given are bound to be...
متن کاملGödel on Turing on Computability
In section 9 of his paper, “On Computable Numbers,” Alan Turing outlined an argument for his version of what is now known as the Church–Turing thesis: “the [Turing machine] ‘computable’ numbers include all numbers which would naturally be regarded as computable” [p. 135]. The argument, which relies on an analysis of calculation by an (ideal) human, has attracted much attention in recent years. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080536